OC-0071: Real Time Interactive Treatment Planning (RTIP) with prioritized goal matching
نویسندگان
چکیده
منابع مشابه
Real - time Prioritized Call Admission
With the deployment of packetized wireless networks, the need for Quality of Service is becoming increasingly important. In order for QoS to be implemented and eeciently supported, a number of key areas in wired/wireless integration need to be addressed. One key issue is the call admission policy for the base station sched-uler. In this paper we provide a call admission control policy that is d...
متن کاملPlanning with Prioritized Goals
In this paper we present an approach to planning with prioritized goal states. To describe the preference ordering on goal states, we make use of ranked knowledge bases which induce a partial preference ordering on plans. We show how an optimal plan can be computed by assigning an integer value to each state in an appropriate manner. We also show how plan optimality can be tested in a similar f...
متن کاملInteractive Visualization for Real-time Public Transport Journey Planning
On-line journey planners encourage the use of public transport systems by easing the task of finding “optimal” routes between start and destination locations. Most of the tools lack the flexibility of comparing journeys that end at different (but maybe nearby) destinations. In this paper, we propose a novel visualization tool for public transport journey planning that integrates graph layout te...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملReal-time Planning by Interleaving Real-time Search with Subgoaling
Recently, real-time planning has been actively studied for solving problems in uncertain and dynamic environments. RTA* is a real-time search algorithm that can provide a computational basis for real-time planning. However, RTA* is not always efficient since obtaining effective heuristic functions is difficult when the problem becomes complicated. In order to keep the problem simple enough for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radiotherapy and Oncology
سال: 2015
ISSN: 0167-8140
DOI: 10.1016/s0167-8140(15)40071-4